Rainbow generalizations of Ramsey theory - a dynamic survey
نویسندگان
چکیده
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs. Revision History • Revision 3: March, 2015. • Revision 2: October, 2014. • Revision 1: July, 2011. • Original: Graphs and Combinatorics, January, 2010. [73] If you have corrections, updates or new results which fit the scope of this work, please contact Colton Magnant at [email protected].
منابع مشابه
Rainbow Generalizations of Ramsey Theory: A Survey
In this work, we collect Ramsey-type results concerning rainbow and proper edge colorings of graphs. Editions • Revision 1: July 2011. • Original: Graphs and Combinatorics, January 2010. If you have corrections, updates or new results which fit the scope of this work, please contact Colton Magnant at [email protected].
متن کاملRainbow Ramsey Theory
This paper presents an overview of the current state in research directions in the rainbow Ramsey theory. We list results, problems, and conjectures related to existence of rainbow arithmetic progressions in [n] and N. A general perspective on other rainbow Ramsey type problems is given.
متن کاملThe strength of the rainbow Ramsey Theorem
The Rainbow Ramsey Theorem is essentially an “anti-Ramsey” theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey’s Theorem, even in the weak system RCA0 of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ra...
متن کاملRainbow numbers for small stars with one edge added
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f(n, H) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H . The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of Kn with rb(n, H) number of colors contains a rainbow copy o...
متن کاملRainbow Arithmetic Progressions and Anti-Ramsey Results
The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distin...
متن کامل